例句與造句

1. The DGP is, by definition, a constraint satisfaction problem.
2. Constraint propagation techniques are methods used to modify a constraint satisfaction problem.
3. Tractability can be obtained by considering specific classes of constraint satisfaction problems.
4. The following are the decomposition methods defined for binary constraint satisfaction problems.
5. Not all constraint satisfaction problems have a join tree.
6. It's difficult to find constraint satisfaction problems in a sentence. 用constraint satisfaction problems造句挺難的
7. Weighted constraint satisfaction problems find innumerable applications in artificial intelligence and computer science.
8. Every constraint satisfaction problem ( CSP ) has a translation into the homomorphism problem.
9. An hinge decomposition is based on the correspondence between constraint satisfaction problems and hypergraphs.
10. The algorithm can be used to explicitly find solutions to a constraint satisfaction problem.
11. Constraint satisfaction problems on finite domains are typically solved using a form of local search.
12. A direct correspondence between the constraint satisfaction problem and the homomorphism problem can be established.
13. A condition that extends the last one holds for non-binary constraint satisfaction problems.
14. A similar definition can be given for a constraint satisfaction problem using its primal graph.
15. The Eternity II challenge was a constraint satisfaction problem very similar to the Tetravex game.
16. A constraint satisfaction problem is typical solved by a constraint logic program having the following structure:
更多例句：  下一頁